Rectilinear 2-center problems
نویسندگان
چکیده
We present e cient algorithms for two problems of facility location. In both problems we want to optimize the location of two facilities with respect to n given sites. The rst problem, the continuous version, has no restrictions for facility locations but in the second one, the discrete version, facilities are chosen from a speci ed set of possible locations. We consider the rectilinear metric L1 and arbitrary dimension d and determine the locations that minimize, over all sites, the maximum distance to the closest facility. The algorithms for the continuous and discrete versions take O(n) and O(n log 2 n log logn+ n logn) running time respectively.
منابع مشابه
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they reeect various real-world situations. The resulting mathematical models have a non-convex objective function and are therefore diicult to tackle using standard methods of location theory even in the case of simpl...
متن کاملRectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملBicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...
متن کاملComputing the Rectilinear Center of Uncertain Points in the Plane
In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set P of n (weighted) uncertain points in the plane and each uncertain point has m possible locations each associated with a probability for the point appearing at that location. The goal is to find a point q∗ in the plane which minimizes the maximum expected rectiline...
متن کاملSolving Rectilinear Steiner Tree Problems
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The best theoretically analyzed algorithm for this problem with a fairly practical behaviour bases on dynamic programming and has a running time of O(n 2 2:62 n) (Ganley/Cohoon). The best implementation can solve random problems of size 35 (Salowe/Warme) within a day. In...
متن کامل